package com.ruijixiang.leetcode.everyday.leetcode2024.leetcode202409;

public class leetcode20240901 {
    public int busyStudent(int[] startTime,int[] endTime,int queryTime){
        int cnt=0;
        for(int i=0;i<startTime.length;i++){
            if(queryTime>=startTime[i] && queryTime<=endTime[i]) cnt++;
        }
        return cnt;
    }
}
